Statistical Relational Learning with Soft Quantifiers
نویسندگان
چکیده
Quantification in statistical relational learning (SRL) is either existential or universal, however humans might be more inclined to express knowledge using soft quantifiers, such as “most” and “a few”. In this paper, we define the syntax and semantics of PSL, a new SRL framework that supports reasoning with soft quantifiers, and present its most probable explanation (MPE) inference algorithm. To the best of our knowledge, PSL is the first SRL framework that combines soft quantifiers with first-order logic rules for modeling uncertain relational data. Our experimental results for link prediction in social trust networks demonstrate that the use of soft quantifiers not only allows for a natural and intuitive formulation of domain knowledge, but also improves the accuracy of inferred results.
منابع مشابه
Extending PSL with Fuzzy Quantifiers
Golnoosh Farnadi, Stephen H. Bach, Marie-Francine Moens, Lise Getoor, Martine De Cock Department of Applied Mathematics, Computer Science and Statistics, Ghent University, Belgium, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, Statistical Relational Learning Group, University of Maryland, USA, University of California, Santa Cruz, USA, Center for Data Science, Univers...
متن کاملCOMBINING FUZZY QUANTIFIERS AND NEAT OPERATORS FOR SOFT COMPUTING
This paper will introduce a new method to obtain the order weightsof the Ordered Weighted Averaging (OWA) operator. We will first show therelation between fuzzy quantifiers and neat OWA operators and then offer anew combination of them. Fuzzy quantifiers are applied for soft computingin modeling the optimism degree of the decision maker. In using neat operators,the ordering of the inputs is not...
متن کاملFairness in Relational Domains
AI and machine learning tools are being used with increasing frequency for decision making in domains that affect peoples’ lives such as employment, education, policing and loan approval. These uses raise concerns about biases of algorithmic discrimination and have motivated the development of fairness-aware machine learning. However, existing fairness approaches are based solely on attributes ...
متن کاملDecision-Driven Models with Probabilistic Soft Logic
We introduce the concept of a decision-driven model, a probabilistic model that reasons directly over the uncertain information of interest to a decision maker. We motivate the use of these models from the perspective of personalized medicine. Decision-driven models have a number of benefits that are of particular value in this domain, such as being easily interpretable and naturally quantifyin...
متن کاملCombining Relational Learning with SMT Solvers Using CEGAR
In statistical relational learning, one is concerned with inferring the most likely explanation (or world) that satisfies a given set of weighted constraints. The weight of a constraint signifies our confidence in the constraint, and the most likely world that explains a set of constraints is simply a satisfying assignment that maximizes the weights of satisfied constraints. The relational lear...
متن کامل